Iterative solution of two matrix equations

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iterative solution of two matrix equations

We study iterative methods for finding the maximal Hermitian positive definite solutions of the matrix equations X + A∗X−1A = Q and X − A∗X−1A = Q, where Q is Hermitian positive definite. General convergence results are given for the basic fixed point iteration for both equations. Newton’s method and inversion free variants of the basic fixed point iteration are discussed in some detail for the...

متن کامل

MINIMAL SOLUTION OF INCONSISTENT FUZZY MATRIX EQUATIONS

Fuzzy liner systems of equations, play a major role in several applications in various area such as engineering, physics and economics. In this paper, we investigate the existence of a minimal solution of inconsistent fuzzy matrix equation. Also some numerical examples are considered.  

متن کامل

New solution of fuzzy linear matrix equations

In this paper, a new method based on parametric form for approximate solu-tion of fuzzy linear matrix equations (FLMEs) of the form AX = B; where Ais a crisp matrix, B is a fuzzy number matrix and the unknown matrix X one,is presented. Then a numerical example is presented to illustrate the proposedmodel.

متن کامل

Positive Definite Solution of Two Kinds of Nonlinear Matrix Equations

Based on the elegant properties of the Thompson metric, we prove that the following two kinds of nonlinear matrix equations X = m ∑ i=1 AiX iAi and X = m ∑ i=1 (AiXAi) δi , (0 < |δi| < 1) always have a unique positive definite solution. Iterative methods are proposed to compute the unique positive definite solution. We show that the iterative methods are more effective as δ = max{|δi|, i = 1, 2...

متن کامل

On the numerical solution of generalized Sylvester matrix equations

‎The global FOM and GMRES algorithms are among the effective‎ ‎methods to solve Sylvester matrix equations‎. ‎In this paper‎, ‎we‎ ‎study these algorithms in the case that the coefficient matrices‎ ‎are real symmetric (real symmetric positive definite) and extract‎ ‎two CG-type algorithms for solving generalized Sylvester matrix‎ ‎equations‎. ‎The proposed methods are iterative projection metho...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics of Computation

سال: 1999

ISSN: 0025-5718

DOI: 10.1090/s0025-5718-99-01122-9